Solving the Rectangular assignment problem and applications
نویسندگان
چکیده
منابع مشابه
Solving the Rectangular assignment problem and applications
The rectangular assignment problem is a generalization of the linear assignment problem (LAP): one wants to assign a number of persons to a smaller number of jobs, minimizing the total corresponding costs. Applications are, e.g., in the fields of object recognition and scheduling. Further, we show how it can be used to solve variants of the LAP, such as the kcardinality LAP and the LAP with out...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the Dynamic Frequency Assignment Problem
Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, and military operations. For all these situations, a frequency assignment problem arises with application of specific characteristics. Different modelling ideas for every problem features, have been developed such as the handling of interference among radio s...
متن کاملSolving the Assignment Problem by Relaxation
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. INFORMS is collaborating with JSTOR to digitize, preserve ...
متن کاملSolving Vehicle Assignment Problem Using Evolutionary Computation
This paper examines the use of evolutionary computation (EC) to find optimal solution in vehicle assignment problem (VAP). The VAP refers to the allocation of the expected number of people in a potentially flooded area to various types of available vehicles in evacuation process. A novel discrete particle swarm optimization (DPSO) algorithm and genetic algorithm (GA) are presented to solve this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Operations Research
سال: 2010
ISSN: 0254-5330,1572-9338
DOI: 10.1007/s10479-010-0757-3